Fast Automatic Passage Ranking (MultiText Experiments for TREC-8)

Passage-based query refinement (MultiText experiments for TREC-6)

The MultiText information retrieval system nds passages of text, as opposed to complete documents, that are likely relevant to a particular topic. Passage retrieval provides the basis for the relevance ranking, term expansion, interactive user interface, and distributed searching used in the MultiText experiments for TREC-6. The essence of relevance ranking is that shorter passages containing a...

Passage-Based Refinement (MultiText Experiements for TREC-6)

The MultiText system retrieves passages, rather than entire documents, that are likely to be relevant to a particular topic. For all runs, we used the reciprocal of the length of each passage as an estimate of its likely relevance and ranked accordingly. For the manual adhoc task we explored the limits of user interaction by judging some 13,000 documents based on retrieved passages. For the aut...

Question Answering by Passage Selection (MultiText Experiments for TREC-9)

Task-Specific Query Expansion (MultiText Experiments for TREC 2003)

I. INTRODUCTION For TREC 2003 the MultiText Project focused its efforts on the Genomics and Robust tracks. We also submitted passage-retrieval runs for the QA track. For the Genomics Track primary task, we used an amalgamation of retrieval and query expansion techniques, including tiering, term rewriting and pseudo-relevance feedback. For the Robust Track, we examined the impact of pseudo-relev...

MultiText Legal Experiments at TREC 2008

Our TREC 2008 e ort used fusion IR methods identical to those used for our TREC 2007 e ort; in addition we used logistic regression to attempt to learn the optimal K value for the primary F1@K measure introduced at TREC 2008. We used the Wumpus search engine combining several methods that have proven successful, including cover density ranking and Okapi BM25 ranking, and combination methods. St...